//删除有序数组中的重复项  力扣26
class Solution {
public:
	int removeDuplicates(vector<int>& nums) {
		int slow = 1;
		int fast = 1;
		for(fast = 1,slow = 1; fast < nums.size();fast++)
		{
			if(fast>0 && nums[fast] != nums[fast-1])
			{
				nums[slow] = nums[fast];
				slow++;
			}
		} 
		return slow;
	}
};
